Covering problem - PDFSEARCH.IO - Document Search Engine

Covering problem
Results: 53

#	Item
31	Press Release The Law Reform Commission of Hong Kong has submitted to the Government a package of proposals covering admission of statements in courts which it says are essential in tackling the problem effectively Add to Reading List Source URL: www.hkreform.gov.hk Language: English - Date: 2012-12-24 14:53:18 Evidence law Confession Jury Police Right to silence in England and Wales Miranda warning Law Criminal procedure Government
32	Journal of Artificial Intelligence Research[removed]429 Submitted 6/06; published 3/07 Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems Add to Reading List Source URL: www.jair.org Language: English - Date: 2009-08-06 19:20:44 NP-complete problems Discrete geometry Operations research Combinatorial optimization Bin packing problem Generalized assignment problem Knapsack problem Packing problem Strongly NP-complete Theoretical computer science Computational complexity theory Mathematics
33	Mathematics 121 Final Terence Tao June 10, 1997 Problem 1. A set X ⊂ Rn is said to be star-shaped at the origin if for every x ∈ X, the line segment {tx : 0 ≤ t ≤ 1} is also contained in X. Add to Reading List Source URL: www.math.ucla.edu Language: English - Date: 2007-08-17 11:19:05 Algebraic topology Homotopy theory Locally connected space Connected space Covering space Locally compact space Continuous function Finite topological space Fundamental group Topology General topology Topological spaces
34	covering-revision-without-comments.dvi Add to Reading List Source URL: dss.in.tum.de Language: English - Date: 2013-01-24 06:29:17 Complexity classes NP-hard NP-complete P versus NP problem NP Polynomial hierarchy Polynomial P Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
35	arXiv:0903.4472v2 [math.AG] 23 Sep[removed]THE FUNDAMENTAL GROUP OF AFFINE CURVES IN POSITIVE CHARACTERISTIC MANISH KUMAR Abstract. It is shown that the commutator subgroup of the fundamental Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-02-06 23:03:01 Group theory Algebraic topology Homotopy theory Field theory Embedding problem Étale fundamental group Covering space Profinite group Fundamental group Abstract algebra Algebra Galois theory
36	A Distributed Approximation Algorithm for Mixed Packing-Covering Linear Programs Faraz Makari Max-Planck-Institut f¨ur Informatik [removed] Add to Reading List Source URL: dws.informatik.uni-mannheim.de Language: English - Date: 2014-09-29 11:40:16 Operations research Combinatorial optimization Convex optimization Relaxation Linear programming Approximation algorithm Algorithm Matching Covering problem Mathematical optimization Mathematics Applied mathematics
37	Brainstorming Techniques Choose a leader/facilitator.  This will be the person responsible for covering the rules of the meeting, enforcing those rules, and recording the ideas as they are mentioned, or assigning that Add to Reading List Source URL: das.nebraska.gov Language: English - Date: 2009-09-09 10:52:07 Product development Social psychology Human behavior Behavior Brainstorming Mind Problem solving Creativity Market research
38	Solution Report Tracking and Dispatching Service Vehicles Problem: With an expansive mine property covering hundreds of square kilometers and operating over a thousand mining machines Add to Reading List Source URL: safe-mine.com Language: English - Date: 2013-03-11 07:54:19 Navigation GPS Geolocation Tracking Satellite navigation systems Vehicle tracking system Fleet management Automatic vehicle location Transport Technology Road transport
39	A Near-Optimality in Covering Games by Exposing Global Information Maria-Florina Balcan, School of Computer Science, Georgia Institute of Technology Sara Krehbiel, School of Computer Science, Georgia Institute of Technol Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2014-06-18 12:45:50 Applied mathematics Price of anarchy Nash equilibrium Price of stability Congestion game Algorithmic game theory Vertex cover Outcome Potential game Game theory Problem solving Theoretical computer science
40	A Multi-Dimensional Multi-Commodity Covering Problem with Applications in Logistics∗ Preprint[removed], revised version from September 4th 2012, TU Berlin, Institut für Mathematik Felix G. König1 , Jannik Matuschke2 Add to Reading List Source URL: www.redaktion.tu-berlin.de Language: English - Date: 2012-09-04 06:38:33 Operations research NP-complete problems Matroid theory Dynamic programming Mathematical optimization Optimal control Sequence container Knapsack problem Linear programming Theoretical computer science Mathematics Applied mathematics

UPDATE